Device authentication

ABSTRACT

A first device in possession of a value is able to determine, without communicating the value and without communicating any information from which the value can be identified, whether a second device is also in possession of the value. The first device accomplishes this with the assistance of a third device that is able to communicate with the first device and with the second device. The second device also does not communicate the value and does not communicate any information from which the value can be identified. The first device may send additional information to the third device which, if passed to the second device, enables the second device to determine that the first device is in possession of the value. The value may be a secret.

REFERENCE TO PRIOR APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 12/685,475, filed Jan. 11, 2010, now U.S. Pat. No. 8,156,336, which is itself a continuation of U.S. patent application Ser. No. 10/836,107, filed Apr. 30, 2004, now U.S. Pat. No. 7,647,498, and the contents of both these applications is incorporated by reference herein.

FIELD OF THE INVENTION

This invention relates generally to communication between electronic devices and, more particularly, to the authentication of two electronic devices including authentication by a third device.

BACKGROUND OF THE INVENTION

In communication between electronic devices, it is sometimes desirable for two devices to communicate with each other using a third device. Typically, one device will seek to establish communication with a second device by making a request to the third device. In such a circumstance, the third device may act as a gatekeeper and prevent or allow such communication based on permissions defined for the two devices.

Where the security of the communication between devices is in issue, the two communicating devices may be provided with a secret value or key that may be used to determine if a channel of communication may be established between the two devices. A third device may execute instructions to permit or deny communication between the devices, based on the shared values held by the respective communication devices.

In a more general way, there may be other reasons for authenticating two devices to a third device. In cases where each of the two devices to be authenticated each have the same secret value, the third device may authenticate the two devices by each of the devices providing their copies of the secret value to the third device for comparison.

However, if the communication between the first or second device and the third device is potentially not secure, or if the third device itself is potentially not secure, direct communication of the secret value or key to the third device is typically not desirable as the secrecy of the shared value is placed at risk.

It is therefore desirable to have a mechanism for authentication of two devices by a third device in which the risk of exposure of the shared value is reduced.

SUMMARY OF THE INVENTION

According to an aspect of the invention there is provided an improved method of device authentication.

According to another aspect of the invention there is provided an authentication procedure, to authenticate two devices each having a shared secret value, in which a third device is able to determine if each of the communicating devices has the same shared secret value without directly being provided with that value.

According to another aspect of the invention there is provided a method for a communications channel to be established between two devices using a third device. The two devices seeking to communicate are provided with a shared secret value. The communicating devices are able to prove to the third device that they each possess the same secret value (and are thus authenticated). In this authentication procedure, the third device is able to determine if each of the communicating devices has the same shared secret value without the third device being provided with that value.

According to another aspect of the invention there is provided a method for securely closing the communications channel established using the authentication described above.

According to another aspect of the invention there is provided a method for the authentication of a first and a second device by a third device, the first and the second devices each possessing a shared secret key value h, each of the devices having available to it a public key P, selected such that the operation of deriving the secret key value h from the product hP is a computationally difficult operation, the method comprising the steps of the first and the second device communicating a set of values to each other using the third device, such that the first device is able to calculate a first expression with a value equivalent to the product hP and the second device is able to calculate a second expression with a value equal to the product hP, the third device retaining copies of the values being communicated between the first and the second device, the method further comprising the step of the third device calculating and comparing the values of the first expression and of the second expression to authenticate the first and the second devices.

According to another aspect of the invention there is provided the above method in which the first device is a wireless handheld device, the second device is an enterprise server, and the third device is a router and in which the step of the third device authenticating the first and second devices comprises the step of establishing a communications channel between the first and second devices.

According to another aspect of the invention there is provided the above method in which the communications channel established includes the third device as part of the channel and the third device having retained the values communicated between the first device and the second device, the method further comprising the step of closing the communication channel between the second device and the third device, the step of closing the said channel comprising the steps of the second device and the third device exchanges sets of closing authentication values to permit the third device to carry out a computation of an expression based on the retained values and the closing authentication values to authenticate the closing the communication channel.

According to another aspect of the invention there is provided a method for the authentication of a first and a second device by a third device, the first and second devices each possessing a shared secret key value h, each of the devices is operative to carry out mathematical operations on defined groups E(F_(q)) and Z_(p), where F_(q) is a finite field of prime order q, including scalar multiplication defined with reference to the group, the method comprising the steps of:

-   -   a) obtaining a public key P, such that P generates a prime         subgroup of the group E(F_(q)) of order p, and making available         to each of the devices the public key P,     -   b) the first device obtaining a random value r_(D) such that         1<r_(D)<p−1, and calculating a value R_(D)=r_(D)P,     -   c) the first device communicating the value R_(D) to the third         device,     -   d) the third device retaining a copy of the value R_(D) and         forwarding the value R_(D) to the second device,     -   e) the second device obtaining a random value r_(B) such that         1<r_(B)<p−1, and calculating a value R_(B)=r_(B)P, where R_(B)         is determined such that it is not equal to R_(D), the second         device obtaining a random value e_(D) such that 1<e_(D)<p−1, the         second device communicating the values e_(D) and R_(B) to the         third device,     -   f) the third device retaining copies of the values R_(B) and         e_(D) forwarding the said values to the first device,     -   g) the first device calculating a value y_(D)=h−e_(D)r_(D) mod         p, the first device obtaining a random value e_(B) such that         1<e_(B)<p−1, the first device communicating values y_(D) and         e_(B) to the third device,     -   h) the third device retaining copies of the values y_(D) and         e_(B) forwarding the said values to the second device,     -   i) the second device calculating a value y_(B)=h−e_(B)r_(B) mod         p, the second device communicating the value y_(B) to the third         device, and     -   j) the third device authenticating the first and second devices         when the condition y_(B)P+e_(B)R_(B)=y_(D)P+e_(D)R_(D) is         satisfied.

According to another aspect of the invention there is provided the above method, further comprising the step of the first device authenticating the second device when the condition y_(B)P+e_(B)R_(B)=hP is satisfied.

According to another aspect of the invention there is provided the above method, further comprising the step of the second device authenticating the first device when the condition y_(D)P+e_(D)R_(D)=hP is satisfied.

According to another aspect of the invention there is provided the above method, in which the first device is identified by a non-authenticating identifier and in which the second device retains a set of key values which set includes a key value shared with the secret key value of the first device, the method comprising the step of the first device communicating the non-authenticating identifier to the second device whereby the second device may select the key value shared with the secret key value of the first device from the set of key values.

According to another aspect of the invention there is provided the above method, further comprising the step of deriving the value h from a shared secret value s.

According to another aspect of the invention there is provided the above method, in which the step of deriving the value h comprises the step of carrying out a one-way hash function on the shared secret value s.

According to another aspect of the invention there is provided the above method, further comprising the steps of one or more of the first, second and third devices checking that the value e_(D) is not zero and/or that the value e_(B) is not zero.

According to another aspect of the invention there is provided the above method, further comprising the steps of one or more of the first, second and third devices checking that the value R_(B) is not equal to the point at infinity and/or that the value R_(D) is not equal to the point at infinity.

According to another aspect of the invention there is provided the above method, further comprising the steps of one or more of the first, second and third devices checking that the value R_(B) is not equal to the value R_(D).

According to another aspect of the invention there is provided the above method in which the first device is a wireless handheld device, the second device is an enterprise server, and the third device is a router and in which the step of the third device authenticating the first and second devices comprises the step of establishing a communications channel between the first and second devices.

According to another aspect of the invention there is provided the above method in which the communications channel is defined by the assignment of an Internet Protocol address to the first device.

According to another aspect of the invention there is provided the above method in which the communications channel established includes the third device as part of the channel and the third device having retained the values y_(D), P, e_(D), and R_(D), the method further comprising the step of closing the communication channel between the second device and the third device, the step of closing the said channel comprising the steps of:

-   -   k) the second device obtaining a random value r_(C) such that         1<r_(C)<p−1, and calculating a value R_(C)=r_(C)P, whereby R_(C)         is constrained to have a different value than both R_(B) and         R_(D),     -   l) the second device communicating the value R_(C) to the third         device,     -   m) the third device obtaining a random value e_(C) such that         1<e_(C)<p−1, the third device communicating the value e_(C) to         the second device,     -   n) the second device authenticating the close operation when the         condition y_(C)P+e_(C)R_(C)=y_(D)P+e_(D)R_(D) is satisfied.

According to another aspect of the invention there is provided the above method further comprising the steps of the second device checking that the value e_(C) is not zero.

According to another aspect of the invention there is provided the above method, further comprising the steps of the third device checking that the value R_(C) is not equal to the point at infinity.

According to another aspect of the invention there is provided the above method, further comprising the steps of one or both of the second and third devices checking that the value R_(C) is not equal to the value R_(B) and is not equal to the value R_(D).

According to another aspect of the invention there is provided the above method, further comprising the steps of one or both of the second and third devices checking that the value e_(C) is not equal to the value e_(D) and is not equal to the value e_(B).

According to another aspect of the invention there is provided the a program product comprising a medium having executable program code embodied in said medium, the executable program code being variously executable on a first device, a second device and a third device, the executable program code being operative to cause the above methods to be carried out.

According to another aspect of the invention there is provided a system comprising a first device, a second device, and a third device, the first and the second devices each possessing a shared secret key value h, each of the devices having available to it a public key P, selected such that the operation of deriving the secret key value h from the product hP is a computationally difficult operation, the first device, the second device and the third device each comprising memory units and processors for storing and executing program code,

-   -   the program code being operative to cause communication of a set         of values between the first device and the second device using         the third device, the program code being operative to cause the         first device to calculate a first expression with a value         equivalent to the product hP and the second device to calculate         a second expression with a value equal to the product hP, the         program code being operative to cause the third device to retain         copies of the values being communicated between the first and         the second device, and the program code being operative to cause         the third device to calculate and compare the values of the         first expression and of the second expression to authenticate         the first and the second devices.

According to another aspect of the invention there is provided the above system in which the first device is a wireless handheld device, the second device is an enterprise server, and the third device is a router and in which the program code operative to cause the third device to authenticate the first and second devices comprises program code operative to establish a communications channel between the first and second devices.

According to another aspect of the invention there is provided the above system in which the communications channel established includes the third device as part of the channel and the third device comprises memory to retain the values communicated between the first device and the second device, the program code further comprising the program code operative to close the communication channel between the second device and the third device, the said code comprising program code operative to exchange sets of closing authentication values between the second device and the third device to permit the third device to carry out a computation of an expression based on the retained values and the closing authentication values to authenticate the closing the communication channel.

According to another aspect of the invention there is provided a system comprising a first device, a second device, and a third device, the first and second devices each possessing a shared secret key value h, each of the devices being operative to carry out mathematical operations on defined groups E(F_(q)) and Z_(p), where F_(q) is a finite field of prime order q, including scalar multiplication defined with reference to the group, the first device, the second device and the third device each comprising memory units and processors for storing and executing program code

-   -   o) the program code being operative to obtain a public key P,         such that P generates a prime subgroup of the group E(F_(q)) of         order p, and to make available to each of the devices the public         key P,     -   p) the program code being operative to cause the first device to         obtain a random value r_(D) such that 1<r_(D)<p−1, and to         calculate a value R_(D)=r_(D)P,     -   q) the program code being operative to cause the first device to         communicate the value R_(D) to the third device,     -   r) the program code being operative to cause the third device to         retain a copy of the value R_(D) and to forward the value R_(D)         to the second device,     -   s) the program code being operative to cause the second device         to obtain a random value r_(B) such that 1<r_(B)<p−1, and to         calculate a value R_(B)=r_(B)P, where R_(B) is determined such         that it is not equal to R_(D), and to cause the second device to         obtain a random value e_(D) such that 1<e_(D)<p−1, and to         communicate the values e_(D) and R_(B) to the third device,     -   t) the program code being operative to cause the third device to         retain copies of the values R_(B) and e_(D) and to forward the         said values to the first device,     -   u) the program code being operative to cause the first device to         calculate a value y_(D)=h−e_(D)r_(D) mod p, to cause the first         device to obtain a random value e_(B) such that 1<e_(B)<p−1, and         to cause the first device to communicate values y_(D) and e_(B)         to the third device,     -   v) the program code being operative to cause the third device to         retain copies of the values y_(D) and e_(B) and to forward the         said values to the second device,     -   w) the program code being operative to cause the second device         to calculate a value y_(B)=h−e_(B)r_(B) mod p, and to cause the         second device to communicate the value y_(B) to the third         device, and     -   x) the program code being operative to cause the third device to         authenticate the first and second devices when the condition         y_(B)P+e_(B)R_(B)=y_(D)P+e_(D)R_(D) is satisfied.

According to another aspect of the invention there is provided the above system in which the first device is a wireless handheld device, the second device is an enterprise server, and the third device is a router and in which the program code operative to cause the third device to authenticate the first and second devices comprises program code operative to establish a communications channel between the first and second devices.

Advantages of the invention include authentication of two devices to a third device, without the need for the third device to have communicated to it, or to have direct information about, a shared secret value possessed by the two authenticated devices.

BRIEF DESCRIPTION OF THE DRAWINGS

In drawings which illustrate by way of example only a preferred embodiment of the invention,

FIG. 1 is block diagram showing two devices and a third device used in the authentication of the first two devices.

DETAILED DESCRIPTION OF THE INVENTION

There are many different contexts in which communications are sought to be established between two different electronic devices and a third device is used to control whether such communication is to take place or not. FIG. 1 is a block diagram that shows device 10 and device 12, for which a communications channel is to be established. In the example of FIG. 1, device 14 determines whether such communications may take place, or not. The determination is made on the basis of authentication of devices 10, 12 by establishing that each device has the shared secret value. In the example of FIG. 1, a direct communications channel is shown between devices 10, 12. Other arrangements are also possible in which devices 10, 12 use device 14 to establish communications and in which, for example, all communications are routed through device 14.

The description of the preferred embodiment refers to communicating devices but it will be understood by those in the art that approach of the preferred embodiment may be implemented for other contexts where authentication of two devices is carried out by a third device. Each of devices 10, 12 must be able to communicate with device 14, but the ultimate purpose of the authentication of devices 10, 12 need not be for their communication with each other.

It will be understood by those skilled in the art that electronic devices, as referred to in this description, include all manner of devices that are able to establish communications with other devices and are able to carry out computations as described below. In particular, the devices include communications servers such as e-mail and other message servers for use in conjunction with networks such as the Internet, wireless handheld communications devices, and other server, desktop, portable or handheld devices, including devices typically used in a computing environment or in telephony.

The preferred embodiment is described as a method that is implemented with respect to such electronic devices. The implementation may be embodied in a computer program product that includes program code on a medium that is deliverable to the devices referred to in this description. Such program code is executable on the devices referred to so as to carry out the method described.

One example of an implementation of the preferred embodiment includes a configuration in which device 14 of FIG. 1 is a router used to assign an IP (Internet Protocol) address to device 10 which is a wireless handheld device. The router of device 14 sets up the connection between the wireless handheld device 10 and an enterprise server, represented in the example of FIG. 1 by device 12. In this example, the device 14 router forwards traffic to the device 10 handheld from device 12 enterprise server. To ensure that no other device is able to improperly obtain an IP address from the device 14 router, in the preferred embodiment both the device 10 handheld and the device 12 enterprise server have a secret value s. As is set out below, the device 14 router is able to establish that the device 10 (handheld) is a trusted device and a communications channel with the device 12 (enterprise server) should be set up by the device 14 (router). In this example, once the authentication has been done by the device 14 router, it forwards communications to the handheld of device 10 by using an assigned IP address and forwarding communications from the enterprise server of device 12 using the Internet.

The description of the preferred embodiment set out below includes several steps in which values as sent between devices are checked. To ensure that there is only one point of failure in the method, when such a check determines that there is an error condition, the approach of the preferred embodiment is to redefine one of the values in a manner that will cause the method to fail to authenticate the devices in its final steps. As will be appreciated by those skilled in the art, there may be other approaches used for carrying out such checking that will result in the method being terminated at an earlier point or in an error condition being specified in another manner.

The preferred embodiment is described with reference to devices 10, 12, 14, each of which are capable of carrying out cryptographic functions and which share, in the embodiment, the following cryptosystem parameters. The mathematical operations described are carried out in groups E(F_(q)) and Z_(p). The group E(F_(q)) is defined in the preferred embodiment as the National Institute of Standards and Technology (NIST) approved 521-bit random elliptic curve over F_(q). This curve has a cofactor of one. The field F_(q) is defined as a finite field of prime order q. Z_(p) is the group of integers modulo p. In the description below, the public key P is defined as a point of E(F_(q)) that generates a prime subgroup of E(F_(q)) of order p. The notation xR represents elliptic curve scalar multiplication, where x is the scalar and R is a point on E(F_(q)). This elliptic curve point R sometimes needs to be represented as an integer for some of the calculations. This representation is

${\overset{\_}{R} = {\left( {\overset{\_}{x}\;{mod}\; 2^{\frac{f}{2}}} \right) + 2^{\frac{f}{2}}}},$ where x is the integer representation of the x-coordinate of the elliptic curve point R and f=log₂ p+1 is the bit length of p.

As will be appreciated, for different implementations of the preferred embodiment, the choice for the groups over which the operations of the preferred embodiment are to be carried out may vary. The elliptic curve is a common group for such operations in cryptography. Any mathematically defined group can be used for the implementation of the preferred embodiment. For example, the group defined by integers modulo a prime number can be used for an implementation.

In Table 1, set out as follows, the calculations and communications of the preferred embodiment are set out. In the preferred embodiment, s is the shared value known to both device 10 and device 12, but not to device 14. In the preferred embodiment, device 12 may communicate with one or more devices and therefore device 10 is provided with an identifier Key ID that specifies which device or class of devices is seeking to communicate with device 12. Similarly, device 12 may, in other implementations, be provided with an identifier to allow device 10 to specify which device is seeking to be authenticated. It will be appreciated that the Key ID described is not sufficient, in itself, to authenticate the device. It will also be appreciated that if the identity of device 10 is obvious from the context, the Key ID may not be necessary. For instance, if device 12 communicates with a single device 10, and no other such devices, then the Key ID may not be necessary.

TABLE 1 DEVICE 10 DEVICE 14 DEVICE 12 Compute: Compute: h = SHA-512(s) h = SHA-512(s) Generate random r_(D), 1 < r_(D) < p − 1 Calculate R_(D) = r_(D)P Send R_(D) to Device 14; Send Key ID to Device 14. While R_(D) == point of infinity, then R_(D) = rand( ). Send R_(D) to Device 12; Send Key ID to Device 12 While R_(D) == point at infinity, then R_(D) = rand( ). Generate random r_(B), 1 < r_(B) < p − 1 Calculate R_(B) = r_(B)P While R_(D) == R_(B), then choose another R_(B). Generate random e_(D), 1 < e_(D) < p − 1 Send Key ID, e_(D) and R_(B) to Device 14. While R_(B) == point at infinity or R_(D) == R_(B), then R_(B) = rand( ). While e_(D) == 0, then e_(D) = rand( ). Send Key ID, e_(D) and R_(B) to Device 10. While R_(B) == point at infinity or R_(D) == R_(B), then R_(B) = rand( ). While e_(D) == 0, e_(D) = rand( ). Compute y_(D) = h − e_(D) r_(D) mod p Generate random e_(B), 1 < e_(B) < p − 1 Send y_(D) and e_(B) to Device 14. While e_(B) == 0 or e_(B) == e_(D), then e_(B) = rand( ). Send y_(D) and e_(B) to Device 12. While e_(B) == 0 or e_(B) == e_(D), then e_(B) = rand( ). Compute y_(B) = h − e_(B) r_(B) mod p. Send y_(B) to Device 14. Send y_(B) to Device 10. If y_(B)P + e_(B) R_(B) != hP, If y_(B)P + e_(B) R_(B) != y_(D)P + If y_(D)P + e_(D) R_(D) != hP, then then reject e_(D) R_(D), then reject reject

The above table specifies steps taken in the process of the preferred embodiment for carrying out authentication of the two communicating devices (devices 10, 12) that includes third party authentication (device 14). It will be understood by those skilled in the art that certain steps may be taken in different order and that, as indicated below, certain steps may be omitted.

The first step carried out in the preferred embodiment is for each of devices 10, 12 to compute a hash function based on the shared secret value s. In the preferred embodiment this hash function is the SHA-512 hash function as defined in the Federal Information Processing Standards Publication 180-2. Other similar hash functions may be used. The value h that is arrived at by applying the hash function is used by both devices 10, 12. Use of a hash function value h instead of direct use of the value s makes the process more secure as the secret shared value s is not directly used in the different calculations set out below. In the preferred embodiment, to provide the shared value s to both devices at an initialization stage, the value s may be randomly generated by one of devices 10, 12 and then communicated to the other using a secure communications channel. For example, where device 10 is a wireless handheld device and device 12 is an enterprise server, the value of the shared secret value can be generated by the enterprise server and then communicated to the wireless handheld when that device is in a cradle that is connected to the enterprise server by a secure network connection.

After determining the value h, the next step in the authentication process of the preferred embodiment is for device 10 to generate a random r_(D) value to be combined with a public key value P. This random value is defined to be greater than 1 and less than p−1. In this example, p is defined to be the order of the prime subgroup of E(F_(q)) generated by the point P in elliptic curve E(F_(q)). Once the random r_(D) value is obtained, the value R_(D) is calculated by taking the result of the scalar multiplication r_(D)P. This randomized public key value (R_(D)) is then sent, with the Key ID value, to device 14. At device 14, an error check on the R_(D) value is carried out. If R_(D) is equal to the point of infinity then there is an error in the public key value (if P is a valid public key then the scalar product will not equal the point of infinity). According to the preferred embodiment, error handling is carried out by setting the R_(D) value equal to a random value (specified by the pseudo code R_(D)=rand( ) in Table 1). The R_(D) value and the Key ID value are then forwarded by device 14 to device 12. It will be noted that in the preferred embodiment, device 14 will retain in memory certain of the values that it receives and forwards. These retained values are used in a final authorization step, as is described below.

At device 12, there is a further error check on the R_(D) value (in comparison with the point of infinity) and a similar error handling step is carried out if necessary. Device 12 also generates its own random value for combination with the public key P. The random value r_(B) is defined in the range of 1 to p−1 and the scalar product r_(B)P defines the value R_(B). An error check at device 12 is carried out to ensure that R_(B) is not equal to R_(D). If these values are equivalent then a new random value r_(B) is defined and a new R_(B) value is calculated. This step is taken because where R_(B) is the equivalent of R_(D), it is possible for an attacker to determine the value of h.

Also in this step at device 12 a randomly defined challenge value e_(D) is obtained. This e_(D) value is generated so as to be greater than 1 and less than p−1. Both the e_(D) and R_(B) values as determined by device 12 are sent by device 12 to device 14. Device 14 may be carrying out multiple similar transactions simultaneously with a set of devices that includes device 10. In order to allow device 14 to determine which of the set of devices including device 10 to send the values to, the Key ID value is also returned to device 14 by device 12, along with the e_(D) and R_(B) values.

At device 14, there is an error check carried out on the R_(B) value. The R_(B) value is compared to the point of infinity and an error handling step is potentially taken. The comparison and error handling are carried out for the R_(B) value in the same way as R_(D) was compared and an error handling step taken in the earlier steps set out above. Similarly, the values of R_(D) and R_(B) are compared to each other and if they are determined to be equivalent then as an error handling step, R_(B) is defined to be a random value. The equivalence of R_(D) and R_(B) is recognized as an error condition because device 12 generates R_(B) in a manner that ensures that it has a different value than R_(D). If, on receipt by device 14, the two values are identical then there must have been an error in transmission or an attacker has redefined the values.

A further check is carried out at device 14 at this time to ensure that e_(D) does not have a value of 0. If the value is 0 then the e_(D) value is set to a random value. If e_(D) has been set to a value of 0 (potentially by an attacker seeking to obtain information to allow a false authentication) then the value of h may become known. To avoid this, e_(D) is given a random value. It will be appreciated that although the check to ensure that R_(D) is not equal to R_(B) and the check to ensure that e_(D) is not equal to 0 may be referred to as error checks, these checks are carried out to ensure that an attacker is not able to obtain information about the value of h.

Once the checking referred to above is complete, device 14 sends Key ID, R_(B) and e_(D) to device 10.

In the preferred embodiment, on receipt of the Key ID, R_(B) and e_(D) values, device 10 will carry out the same checks that were carried out at device 10, and take the same error handling steps (setting either R_(B) or e_(D) to 0, as needed). As was the case with the communication of the values between device 12 and device 14, the communication between device 14 and device 10 is a potential point at which an attacker may seek to alter values to gain access to the communication channel through improper authentication of a device.

As is shown in Table 1, once the checking of values R_(B) and e_(D) has taken place at device 10, there is a calculation of a y_(D) value. The definition of the value is: y _(D) =h−e _(D) r _(D) mod p As is described in more detail below, the y_(D) value is used in comparisons that will authenticate the devices 10, 12 to each other and to device 14.

Another step carried out by device 10 is the generation of a challenge value. This challenge value is an e_(B) value that is randomly chosen from the range greater than 1 and less than p−1. Both y_(D) and e_(B) values are then sent to device 14.

At device 14, the e_(B) value is compared with 0 and with e_(D). If e_(B) has a value equal to either of these, then e_(B) is set to a random value.

The e_(B) value is then sent by device 14 to device 12, along with the y_(D) value. At device 12 the e_(B) value is again checked (against 0 and e_(D)) and if the check is not successful, e_(B) is set to a random value. A y_(B) value is then calculated: y _(B) =h−e _(B) r _(B) mod p

As will be seen, the value y_(B) is defined in a manner symmetrical to the definition of y_(D). The y_(B) value is sent by device 12 where was calculated, to device 14 and from there to device 10.

At this point in the process, the y_(D) and R_(D) values have been sent by device 10 to device 12, and the y_(B) and R_(B) values has been sent by device 12 to device 10. Further, copies of the values that have been forwarded to and sent from device 14 have also be retained at device 14. Consequently, as will be seen in the last step of Table 1, authentication steps are carried out to authenticate that both device 10 and device 12 have the same shared secret value s.

In particular, at device 14, there is an authentication of the two devices if and only if y _(B) P±e _(B) R _(B) =y _(D) P+e _(D) R _(D).

At device 10, there is authentication of device 12 if and only if y _(B) P+e _(B) R _(B) =hP.

At device 12, there is authentication of device 10 if and only if y _(D) P+e _(D) R _(D) =hP.

As will be apparent to those skilled in the art, the process of authentication set out above makes use of certain of the mathematical operations and equivalencies described and used in the Schnorr identification scheme (see for example A. Menezes, P. van Oorschot and S. Vanstone. Handbook of Applied Cryptography, CRC Press, New York, 1997). The preferred embodiment, however, permits two devices to mutually authenticate each other and to permit a third device to authenticate both devices. The authentication is carried out by the third device (device 14 in the example) despite the fact that the third device does not know the secret value s that is shared between the two devices 10, 12. It will be noted that the mutual authentication between devices 10, 12 is carried out at the same time, as a result of a series of overlapping steps having been taken.

The authentication process of the preferred embodiment is suitable for use where a communications channel between two devices is being defined and a third device will provide information to allow the channel to be set up. This may occur where a wireless handheld uses a routing device to gain access to an enterprise server. The routing device acts as the third device that requires authentication of the server and the wireless handheld device. The above process permits such authentication to be carried out and to have the third device (the router, for example) make the authentication without having knowledge of the secret value and with a reduced set of state information.

The above description of the preferred embodiment includes error checking applied to the R value. This is carried out to determine if R is a valid public key value. As will be appreciated, this error checking may be omitted from the method of the preferred embodiment if it can be ensured that R_(D) is not equal to R_(B), although it is generally preferable to carry out these checks to ensure that the process is being carried out correctly. Further, the preferred embodiment describes the computation of a hash value of the secret value at device 10 and at device 12. The use of a hash function to encode the secret value s as the value h, is not required although it is a preferred step to minimize the direct use of the secret value. If there is no use of a hash function in this manner, the secret value is used directly to calculate the different authentication values.

As referred to above, the authentication process may be used in establishing a communications channel from one device to a second device through a third device. In this case, it is advantageous to use an authenticated protocol to close the channel as between the third device and one of the other two. In the preferred embodiment such an authenticated close protocol may be put in place on the basis that the third device retains certain values. In particular, after the authentication has taken place prior to establishing the communications channel, the third device (device 14, in the example of FIG. 1) retains values y_(D)P+e_(D)R_(D), R_(D), R_(B), e_(D), e_(B). Device 12 retains values R_(D), R_(B), e_(D), e_(B), h. In Table 2, an authentication process is set out for use where device 14 has authenticated device 12, as is set out above and device 12 seeks to close the communications channel.

Device 14 Device 12 Device 12 initiates closing the connection with device 14. Pick random r_(C), 1 < r_(C) < p − 1 Calculate R_(C) = r_(C)P While R_(C) == R_(B) or R_(C) == R_(B), then choose another R_(C). Send R_(C) to device 14. While R_(C) == point at infinity or R_(C) == R_(B) or R_(C) == R_(D), then R_(C) = rand( ). Generate random e_(C), 1 < e_(C) < p − 1 While or e_(C) == e_(D) or e_(C) == e_(B), then choose another e_(C). Send to e_(C) device 12. While e_(C) == 0 or e_(C) == e_(D) or e_(C) == e_(B), then e_(C) = rand( ). Compute y_(C) = h − e_(C)r_(C) mod p Send y_(C) to device 14. If y_(C)P + e_(C)R_(C) != y_(D)P + e_(D)R_(D), then reject

As will be seen from the above, the authentication for the close protocol is available, even though device 14 (the third device) does not possess or use directly security value s or the hash value h. In this case, the authentication follows the Schnorr identification scheme, based on the values that are retained by the devices referred to above (devices 12, 14 in the example given). These values are available to the third device as a result of using the authentication process described above.

Various embodiments of the present invention having been thus described in detail by way of example, it will be apparent to those skilled in the art that variations and modifications may be made without departing from the invention. The invention includes all such variations and modifications as fall within the scope of the appended claims. 

We claim:
 1. A method to be performed by a first device that possesses a value h for determining whether a second device possesses the value h, the method comprising: generating a product R_(D) and transmitting the product R_(D) to a third device, wherein R_(D) is a product of a random value r_(D) and a public key value P; receiving from the third device a challenge value e_(D) that was received by the third device from the second device; receiving from the third device a product R_(B) that was received by the third device from the second device, wherein R_(B) is a product of a random value r_(B) and the public key value P; obtaining a challenge value e_(B) and transmitting the challenge value e_(B) to the third device; receiving from the third device a value y_(B) that was received by the third device from the second device; calculating y_(B)P+e_(B)R_(B) to obtain a first result; calculating hP to obtain a second result; comparing the first result to the second result; and determining that the second device is in possession of the value h when the first result is identical to the second result, wherein the public key value P generates a prime subgroup of the group E(F_(q)) of order p, wherein F_(q) is a finite field of prime order q, wherein the random values r_(D) and r_(B) are between the number 1 and the number (p−1), and wherein the challenge values e_(D) and e_(B) are between the number 1 and the number (p−1).
 2. The method of claim 1, wherein the value h is derived from a secret value s, the method further comprising: determining that the second device is in possession of the secret value s when the first result is identical to the second result.
 3. The method of claim 2, wherein the value h is a hash of the secret value s.
 4. The method of claim 1, further comprising: generating a value y_(D) and transmitting the value y_(D) to the third device, thus enabling the third device to determine that the first device is in possession of the value h, for further transmission by the third device to the second device, thus enabling the second device to determine that the first device is in possession of the value h.
 5. The method of claim 4, wherein the value y_(D) is generated from the value h, from the challenge value e_(D), and from the random value r_(D).
 6. A method for determining whether a first device possesses a value h, the method to be performed by a second device that possesses the value h, the method comprising: receiving from a third device a product R_(D) that was received by the third device from the first device, wherein R_(D) is a product of a random value r_(D) and a public key value P; generating a product R_(B) and transmitting the product R_(B) to the third device, wherein R_(B) is a product of a random value r_(B) and the public key value P; obtaining a challenge value e_(D) and transmitting the challenge value e_(D) to the third device; receiving from the third device a value y_(D) that was received by the third device from the first device; receiving from the third device a challenge value e_(B) that was received by the third device from the first device; calculating y_(D)P+e_(D)R_(D) to obtain a first result; calculating hP to obtain a second result; comparing the first result to the second result; and determining that the first device is in possession of the value h when the first result is identical to the second result, wherein the public key value P generates a prime subgroup of the group E(F_(q)) of order p, wherein F_(q) is a finite field of prime order q, wherein the random values r_(D) and r_(B) are between the number 1 and the number (p−1), and wherein the challenge values e_(D) and e_(B) are between the number 1 and the number (p−1).
 7. The method of claim 6, wherein the value h is derived from a secret value s, the method further comprising: determining that the first device is in possession of the secret value s when the first result is identical to the second result.
 8. The method of claim 7, wherein the value h is a hash of the secret value s.
 9. The method of claim 6, further comprising: generating a value y_(B) and transmitting the value y_(B) to the third device, thus enabling the third device to determine that the second device is in possession of the value h, for further transmission by the third device to the first device, thus enabling the first device to determine that the second device is in possession of the value h.
 10. The method of claim 9, wherein the value y_(B) is generated from the value h, from the challenge value e_(B), and from the random value r_(B).
 11. The method of claim 6, further comprising: generating a product R_(C) and transmitting the product R_(C) to the third device, wherein R_(C) is a product of a random value r_(C) and the public key value P, and further wherein R_(C) is constrained to have a different value than both the product R_(B) and the product R_(D); receiving from the third device a challenge value e_(C) that is constrained to have a different value than both the challenge value e_(B) and the challenge value e_(D); and generating a value y_(C) and transmitting the value y_(C) to the third device to enable the third device to determine that the second device is still in possession of the value h.
 12. The method of claim 11, wherein the value y_(C) is generated from the value h, from the challenge value e_(C), and from the random value r_(C).
 13. A program product comprising a computer readable non-transitory storage medium having executable program code stored in said medium, the executable program code being operative, when executed, to cause a first device that is in possession of a value h: to generate a product R_(D) and to transmit the product R_(D) to a third device, wherein R_(D) is a product of a random value r_(D) and a public key value P; to receive from the third device a challenge value e_(D) that was received by the third device from a second device; to receive from the third device a product R_(B) that was received by the third device from the second device, wherein R_(B) is a product of a random value r_(B) and the public key value P; to obtain a challenge value e_(B) and to transmit the challenge value e_(B) to the third device; to receive from the third device a value y_(B) that was received by the third device from the second device; to calculate y_(B)P+e_(B)R_(B) to obtain a first result; to calculate hP to obtain a second result; to compare the first result to the second result; and to determine that the second device is in possession of the value h when the first result is identical to the second result wherein the public key value P generates a prime subgroup of the group E(F_(q)) of order p, wherein F_(q) is a finite field of prime order q, wherein the random values r_(D) and r_(B) are between the number 1 and the number (p−1), and wherein the challenge values e_(D) and e_(B) are between the number 1 and the number (p−1).
 14. A program product comprising a computer readable non-transitory storage medium having executable program code stored in said medium, the executable program code being operative, when executed, to cause a second device that is in possession of a value h: to receive from a third device a product R_(D) that was received by the third device from a first device, wherein R_(D) is a product of a random value r_(D) and a public key value P; to generate a product R_(B) and to transmit the product R_(B) to the third device, wherein R_(B) is a product of a random value r_(B) and the public key value P; to obtain a challenge value e_(D) and to transmit the challenge value e_(D) to the third device; to receive from the third device a value y_(D) that was received by the third device from the first device; to receive from the third device a challenge value e_(B) that was received by the third device from the first device; to calculate y_(D)P+e_(D)R_(D) to obtain a first result; to calculate hP to obtain a second result; to compare the first result to the second result; and to determine that the first device is in possession of the value h when the first result is identical to the second result, wherein the public key value P generates a prime subgroup of the group E(F_(q)) of order p, wherein F_(q) is a finite field of prime order q, wherein the random values r_(D) and R_(B) are between the number 1 and the number (p−1), and wherein the challenge values e_(D) and e_(B) are between the number 1 and the number (p−1).
 15. The program product of claim 14, the executable program code being further operative, when executed, to cause the second device: to generate a product R_(C) and to transmit the product R_(C) to the third device, wherein R_(C) is a product of a random value r_(C) and the public key value P, and further wherein R_(C) is constrained to have a different value than both the product R_(B) and the product R_(D); to receive from the third device a challenge value e_(C) that is constrained to have a different value than both the challenge value e_(B) and the challenge value e_(D); and to generate a value y_(C) and to transmit the value y_(C) to the third device to enable the third device to determine that the second device is still in possession of the value h.
 16. A first device adapted: to possess a value h; to generate a product R_(D) and to transmit the product R_(D) to a third device, wherein R_(D) is a product of a random value r_(D) and a public key value P; to receive from the third device a challenge value e_(D) that was received by the third device from a second device; to receive from the third device a product R_(B) that was received by the third device from the second device, wherein R_(B) is a product of a random value r_(B) and the public key value P; to obtain a challenge value e_(B) and to transmit the challenge value e_(B) to the third device; to receive from the third device a value y_(B) that was received by the third device from the second device; to calculate y_(B)P+e_(B)R_(B) to obtain a first result; to calculate hP to obtain a second result; to compare the first result to the second result; and to determine that the second device is in possession of the value h when the first result is identical to the second result wherein the public key value P generates a prime subgroup of the group E(F_(q)) of order p, wherein F_(q) is a finite field of prime order q, wherein the random values r_(D) and r_(B) are between the number 1 and the number (p−1), and wherein the challenge values e_(D) and e_(B) are between the number 1 and the number (p−1).
 17. The first device of claim 16, wherein the first device comprises a wireless handheld device.
 18. A second device adapted: to possess a value h; to receive from a third device a product R_(D) that was received by the third device from a first device, wherein R_(D) is a product of a random value r_(D) and a public key value P; to generate a product R_(B) and to transmit the product R_(B) to the third device, wherein R_(B) is a product of a random value r_(B) and the public key value P; to obtain a challenge value e_(D) and to transmit the challenge value e_(D) to the third device; to receive from the third device a value y_(D) that was received by the third device from the first device; to receive from the third device a challenge value e_(B) that was received by the third device from the first device; to calculate y_(D)P+e_(D)R_(D) to obtain a first result; to calculate hP to obtain a second result; to compare the first result to the second result; and to determine that the first device is in possession of the value h when the first result is identical to the second result, wherein the public key value P generates a prime subgroup of the group E(F_(q)) of order p, wherein F_(q) is a finite field of prime order q, wherein the random values r_(D) and r_(B) are between the number 1 and the number (p−1), and wherein the challenge values e_(D) and e_(B) are between the number 1 and the number (p−1).
 19. The second device of claim 18, wherein the second device comprises an enterprise server. 